Tight bounds for reachability problems on one-counter and pushdown systems
نویسندگان
چکیده
We consider the problem of reachability on One-Counter Systems (OCSs) and Pushdown (PDSs). The has a well-known O(n3) bound both models, while is believed to be tight for PDSs. Here we establish new upper lower bounds OCSs restricted show that can solved (i) in O(nω⋅log2n) time OCSs, (ii) O(n2) sparse PDSs when witness executions stack height bounded by logn. Moreover, prove similar bounds.
منابع مشابه
Resource - bounded Reachability on Pushdown Systems
In this work, we combine the theory of pushdown systems and the theory of resource automata (also known as B-automata) to a model which we call resource pushdown systems. This model can be seen as pushdown system with resource counters which support the operations increment, reset to zero and no-change. The pushdown rules are annotated with these counter operations. Resource pushdown systems ca...
متن کاملInclusion problems for one-counter systems
We study the decidability and complexity of verification problems for infinite-state systems. A fundamental question in formal verification is if the behaviour of one process is reproducible by another. This inclusion problem can be studied for various models of computation and behavioural preorders. It is generally intractable or even undecidable already for very limited computational models. ...
متن کاملReachability in pushdown systems: algorithms and applications
This thesis presents reachability algorithms for pushdown systems and their applications to different areas. Roughly speaking, a pushdown system is a stack-based machine whose stack can be unbounded, making it a natural model for sequential programs. Inspired by applications, the thesis analyzes reachability in more generalized pushdown models—alternating pushdown systems and pushdown networks—...
متن کاملTight bounds for some problems
There are a number of fundamental problems in eomputational geometry for which work-optimal aJgorithDls exist which have a parallel running -fuDe of O(log n) in the PRAM model. These include problems like two and three dimensional convex-hulls, trapeSoidal decomposition, arrangement coDStruc:.tion, dommance among others. Further improvements in running time to sub-logarithmic range were not con...
متن کاملReachability in Timed Counter Systems
We introduce Timed Counter Systems, a new class of systems mixing clocks and counters. Such systems have an infinite state space, and their reachability problems are generally undecidable. By abstracting clock values with a Region Graph, we show the Counter Reachability Problem to be decidable for three subclasses : Timed VASS, Bounded Timed Counter Systems, and Reversal-Bounded Timed Counter S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2021
ISSN: ['1872-6119', '0020-0190']
DOI: https://doi.org/10.1016/j.ipl.2021.106135